Junction tree algorithms for solving sparse linear systems
نویسندگان
چکیده
In this technical report we present a self-contained introduction to algorithms that solve sparse linear systems by message passing on a junction tree (a.k.a. clique tree). When solving the systemAx = b whereA is a sparse n×nmatrix, these methods require O(n · w3) time and O(n · w2) space, where w is the treewidth of A’s sparsity graph. These algorithms are useful for parallel or distributed solutions to linear systems, or to efficiently solve sets of similar linear systems.
منابع مشابه
Efficient Scalable Algorithms for Solving Dense Linear Systems with Hierarchically Semiseparable Structures
Hierarchically semiseparable (HSS) matrix techniques are emerging in constructing superfast direct solvers for both dense and sparse linear systems. Here, we develop a set of novel parallel algorithms for key HSS operations that are used for solving large linear systems. These are parallel rank-revealing QR factorization, HSS constructions with hierarchical compression, ULV HSS factorization, a...
متن کاملScalable Parallel Algorithms for Solving Sparse Systems of Linear Equations∗
We have developed a highly parallel sparse Cholesky factorization algorithm that substantially improves the state of the art in parallel direct solution of sparse linear systems—both in terms of scalability and overall performance. It is a well known fact that dense matrix factorization scales well and can be implemented efficiently on parallel computers. However, it had been a challenge to dev...
متن کاملEfficient Scalable Algorithms for Hierarchically Semiseparable Matrices
Hierarchically semiseparable (HSS) matrix algorithms are emerging techniques in constructing the superfast direct solvers for both dense and sparse linear systems. Here, we develope a set of novel parallel algorithms for the key HSS operations that are used for solving large linear systems. These include the parallel rank-revealing QR factorization, the HSS constructions with hierarchical compr...
متن کاملA Total Ratio of Vegetation Index (TRVI) for Shrubs Sparse Cover Delineating in Open Woodland
Persian juniper and Pistachio are grown in low density in the rangelands of North-East of Iran. These rangelands are populated by evergreen conifers, which are widespread and present at low-density and sparse shrub of pistachio in Iran, that are not only environmentally but also genetically essential as seed sources for pistachio improvement in orchards. Rangelands offer excellent opportunities...
متن کاملOn Parallel Solution of Sparse Triangular Linear Systems in CUDA
The acceleration of sparse matrix computations on modern many-core processors, such as the graphics processing units (GPUs), has been recognized and studied over a decade. Significant performance enhancements have been achieved for many sparse matrix computational kernels such as sparse matrix-vector products and sparse matrix-matrix products. Solving linear systems with sparse triangular struc...
متن کامل